Search results for "Natural number"
showing 10 items of 21 documents
Finitary shadows of compact subgroups of $$S(\omega )$$
2020
AbstractLet LF be the lattice of all subgroups of the group $$SF(\omega )$$SF(ω) of all finitary permutations of the set of natural numbers. We consider subgroups of $$SF(\omega )$$SF(ω) of the form $$C\cap SF(\omega )$$C∩SF(ω), where C is a compact subgroup of the group of all permutations. In particular, we study their distribution among elements of LF. We measure this using natural relations of orthogonality and almost containedness. We also study complexity of the corresponding families of compact subgroups of $$S(\omega )$$S(ω).
Extended Natural Numbers and Counters
2020
Summary This article introduces extended natural numbers, i.e. the set ℕ ∪ {+∞}, in Mizar [4], [3] and formalizes a way to list a cardinal numbers of cardinals. Both concepts have applications in graph theory.
Co-learnability and FIN-identifiability of enumerable classes of total recursive functions
1994
Co-learnability is an inference process where instead of producing the final result, the strategy produces all the natural numbers but one, and the omitted number is an encoding of the correct result. It has been proved in [1] that co-learnability of Goedel numbers is equivalent to EX-identifiability. We consider co-learnability of indices in recursively enumerable (r.e.) numberings. The power of co-learnability depends on the numberings used. Every r.e. class of total recursive functions is co-learnable in some r.e. numbering. FIN-identifiable classes are co-learnable in all r.e. numberings, and classes containing a function being accumulation point are not co-learnable in some r.e. number…
Integer Complexity: Experimental and Analytical Results II
2015
We consider representing natural numbers by expressions using only 1’s, addition, multiplication and parentheses. Let \( \left\| n \right\| \) denote the minimum number of 1’s in the expressions representing \(n\). The logarithmic complexity \( \left\| n \right\| _{\log } \) is defined to be \({ \left\| n \right\| }/{\log _3 n}\). The values of \( \left\| n \right\| _{\log } \) are located in the segment \([3, 4.755]\), but almost nothing is known with certainty about the structure of this “spectrum” (are the values dense somewhere in the segment?, etc.). We establish a connection between this problem and another difficult problem: the seemingly “almost random” behaviour of digits in the ba…
A note on lower bounds of norms of averaging operators
2000
For any natural number n we obtain some examples of continuous onto maps $\phi : S\,\,\longrightarrow\, \,T$ for which Ditor's set $\Delta _\phi ^2(2, 2)$ is empty but every averaging operator for $\phi $ has norm greater or equal to 2n + 1.
Asymptotics for Graded Capelli Polynomials
2014
The finite dimensional simple superalgebras play an important role in the theory of PI-algebras in characteristic zero. The main goal of this paper is to characterize the T 2-ideal of graded identities of any such algebra by considering the growth of the corresponding supervariety. We consider the T 2-ideal Γ M+1,L+1 generated by the graded Capelli polynomials C a p M+1[Y,X] and C a p L+1[Z,X] alternanting on M+1 even variables and L+1 odd variables, respectively. We prove that the graded codimensions of a simple finite dimensional superalgebra are asymptotically equal to the graded codimensions of the T 2-ideal Γ M+1,L+1, for some fixed natural numbers M and L. In particular csupn(Γk2+l2+1…
Basic Definitions and Facts
2001
Symbol is treated here as a primitive entity as point or line in geometry. Let Con = {f α : α < β} be a well-ordered set of symbols called a language type. β is an ordinal number. The elements of the above set are called connectives. To each connective f α a natural number α(α) ∈ w called the rank of f α or the arity of f α is assigned. The arity α(α) defines the number of arguments of f α . Thus we speak of nullary, unary, or binary connectives, etc. In the sequel Con is assumed to be fixed but arbitrary.
Finite 2-groups with odd number of conjugacy classes
2016
In this paper we consider finite 2-groups with odd number of real conjugacy classes. On one hand we show that if $k$ is an odd natural number less than 24, then there are only finitely many finite 2-groups with exactly $k$ real conjugacy classes. On the other hand we construct infinitely many finite 2-groups with exactly 25 real conjugacy classes. Both resuls are proven using pro-$p$ techniques and, in particular, we use the Kneser classification of semi-simple $p$-adic algebraic groups.
Combinatorial aspects of L-convex polyominoes
2007
We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an ''L'' shaped path in one of its four cyclic orientations. The paper proves bijectively that the number f"n of L-convex polyominoes with perimeter 2(n+2) satisfies the linear recurrence relation f"n"+"2=4f"n"+"1-2f"n, by first establishing a recurrence of the same form for the cardinality of the ''2-compositions'' of a natural number n, a simple generalization of the ordinary compositions of n. Then, such 2-compositions are studied and bijectively related to certain words of a regular language over four letters which is in turn bijectively related to L-convex polyominoes. In …
On the Distribution ofB3-Sequences
1996
Abstract An infinite set of natural numbers is called aB3-sequence if all sumsa1+a2+a3withaj∈Aanda1⩽a2⩽a3are distinct. LetA(n) be the number of positive elements ⩽ninA. P. Erdos conjectures that everyB3-sequenceAsatisfies lim infn→∞ A(n) n−1/3=0. In this paper we prove that no sequence satisfyingA(n)∼αn1/3can be aB3-sequence. We also give other necessary conditions for aB3-sequence.